Constrained Ordering
نویسندگان
چکیده
We investigate the problem of finding a total order of a finite set that satisfies various local ordering constraints. Depending on the admitted constraints, we provide an efficient algorithm or prove NP-completeness. To this end, we define a reduction technique and discuss its properties.
منابع مشابه
Resource Constrained Project Scheduling with Material Ordering: Two Hybridized Meta-Heuristic Approaches (TECHNICAL NOTE)
Resource constrained project scheduling problem (RCPSP) is mainly investigated with the objective of either minimizing project makespan or maximizing project net present value. However, when material planning plays a key role in a project, the existing models cannot help determining material ordering plans to minimize material costs. In this paper, the RCPSP incorporated with the material order...
متن کاملRepeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کاملAn Algorithm for Retrieving Skyline Points based on User Specified Constraints using the Skyline Ordering
Given a multidimensional data set, a skyline query returns the interesting points that are not dominated by other points. The actual cardinality (s) of a skyline query result may vary substantially from the desired result cardinality (k). An approach called skyline ordering is used that forms a skyline based partitioning of a given data set, it provides an ordering among the partitions. The con...
متن کاملTheorem Proving with Sequence Variables and Flexible Arity Symbols
An ordering for terms with sequence variables and flexible arity symbols is presented. The ordering coincides with the lexicographic extension of multiset path ordering on terms without sequence variables. It is shown that the classical strict superposition calculus with ordering and equality constraints can be used as a refutationally complete proving method for well-constrained sets of clause...
متن کاملOn constrained dual recoverability theorems
In a recent paper [“Paretian Welfare Judgements and Bergsonian Social Choice,” Economic Journal, Vol. 109, 1999, pp. 204-220], Suzumura proposed a possible way of relating the two schools of “new” welfare economics. According to his proposal, the logical possibility of the Paretian “new” welfare economics can be reduced to the constrained dual choice-functional recoverability of the Pareto-comp...
متن کاملTitle On Constrained Dual Recoverability Theorems
In a recent paper [“Paretian Welfare Judgements and Bergsonian Social Choice,” Economic Journal, Vol. 109, 1999, pp. 204-220], Suzumura proposed a possible way of relating the two schools of “new” welfare economics. According to his proposal, the logical possibility of the Paretian “new” welfare economics can be reduced to the constrained dual choice-functional recoverability of the Pareto-comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005